Barrier Synchronization on Wormhole-Routed Networks

نویسندگان

  • Yuzhong Sun
  • Paul Y. S. Cheung
  • Xiaola Lin
چکیده

ÐIn this paper, we propose an efficient barrier synchronization scheme on networks with arbitrary topologies. We first present a distributed method in building a barrier routing tree. The barrier messages can be delivered adaptively according to the hierarchy of the established barrier tree to void congestion and faulty nodes in the network. We then propose a new technique, called bandwidth-preempting technique, for a blocked barrier message to preempt a channel occupied by a data message so that the latency of a barrier message can be controlled without affecting much of the overall system performance. We also propose an analytical performance model and present simulation results for the performance evaluation of the proposed scheme. Performance evaluations show that the proposed scheme outperforms the existing algorithms for barrier synchronization. Index TermsÐBarrier synchronization, network topology, tree-based routing, data message, barrier message, bandwidth-preempting

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Implementation of Barrier Synchronization in Wormhole-Routed Hypercube Multicomputers

This paper addresses eecient implementation of barrier synchronization in wormhole-routed hypercube multicomputers. For those systems supporting only unicast communication in hardware, a novel software tree approach, the U-cube tree, is proposed. An important feature of the U-cube tree is that all messages injected into the network are guaranteed to be contention-free. Performance measurements ...

متن کامل

Fast Barrier Synchronization in Wormhole k-ary n-cube Networks with Multidestination Worms1

This paper presents a new approach to implement fast barrier synchronization in wormhole k-ary n-cubes. The novelty lies in using multidestination messages instead of the traditional single destination messages. Two diierent multidestination worm types, gather and broadcasting, are introduced to implement the report and wake-up phases of barrier synchronization , respectively. Algorithms for co...

متن کامل

Optimal Phase Barrier Synchronization in K-ary N-cube Wormhole-routed Systems Using Multirendezvous Primitives

We propose a new multiphase barrier synchronization algorithm for k-ary n-cube networks using our earlier developed multirendezvous synchronization primitives 4]. The algorithm incurs minimal cost with optimal number of communication phases. The optimality is guided by system connguration parameters (k; n) and technological parameters t s (communication start-up cost) and t p (link-propagation ...

متن کامل

Global Reduction in Wormhole K-ary N-cube Networks with Multidestination Exchange Worms 1

This paper presents a new approach to implement global reduction operations (including barrier synchronization) in wormhole k-ary n-cubes. The novelty lies in using multi-destination message passing mechanism instead of single destination (unicast) messages. Using pairwise exchange worms along each dimension, it is shown that global reduction and barrier synchronization operations, as deened by...

متن کامل

Global reduction in wormhole k-ary n-cube networks with multidestination exchange worms

This paper presents a new approach to implement global reduction operations in wormhole k-ary n-cubes. The novelty lies in using multidestination message passing mechanism instead of single destination (unicast) messages. Using pairwise exchange worms along each dimension, it is shown that complete global reduction and barrier synchronization operations , as deened by the Message Passing Interf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Parallel Distrib. Syst.

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2001